The Smith Normal Form Distribution of A Random Integer Matrix
نویسندگان
چکیده
منابع مشابه
The Smith Normal Form Distribution of A Random Integer Matrix
We show that the density μ of the Smith normal form (SNF) of a random integer matrix exists and equals a product of densities μps of SNF over Z/p sZ with p a prime and s some positive integer. Our approach is to connect the SNF of a matrix with the greatest common divisors (gcds) of certain polynomials of matrix entries, and develop the theory of multi-gcd distribution of polynomial values at a...
متن کاملOn Efficient Sparse Integer Matrix Smith Normal Form Computations
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of word-size primes. Consequently, the algorithm does not suffer from coefficient growth. We have implemented several variants of this algorithm (Elimination and/or Black-Box techniques) since...
متن کاملThe Smith Normal Form of a Matrix
In this note we will discuss the structure theorem for finitely generated modules over a principal ideal domain from the point of view of matrices. We will then give a matrixtheoretic proof of the structure theorem from the point of view of the Smith normal form of a matrix over a principal ideal domain. One benefit from this method is that there are algorithms for finding the Smith normal form...
متن کاملThe Smith Normal Form of a Matrix
In this note we will discuss the structure theorem for finitely generated modules over a principal ideal domain from the point of view of matrices. We will then give a matrixtheoretic proof of the structure theorem from the point of view of the Smith normal form of a matrix over a principal ideal domain. One benefit from this method is that there are algorithms for finding the Smith normal form...
متن کاملComputing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A n n the algorithm requires O n3 5 logn 4 5 bit operations (assuming for now that entries in A have constant size) using standard matrix and integer arithmetic. Using asymptotically fast matrix arithmetic, a variant is described which requires O n2 2 log2 n loglogn bit operations, wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1098140